
#include "quicksort.hpp"
using namespace std;

void swap(BigNumber* a, BigNumber* b)
{
    BigNumber t = *a;
    *a = *b;
    *b = t;
}

//以最后一个元素为枢轴，
int partition(BigNumber arr[], int low, int high)
{
    // pivot
    BigNumber pivot = arr[high];
    int i = (low - 1);

    for (int j = low; j <= high - 1; j++) {
        if (arr[j] < pivot) {
            i++;
            swap(&arr[i], &arr[j]);
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}

void quickSort(BigNumber arr[], int low, int high)
{
    if (low < high) {
        // pi 枢轴， pi已在最终位置
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}
